From Gabbay-style rules to labelled deduction
نویسنده
چکیده
Is there a link between Gabbay-style rules, modal languages with nominals, and labelled deduction? It seems there should be: though they differ in many ways, all share the idea that state-names are important in modal deduction. I shall show how to move from a Gabbay-style rule to labelled deduction via the basic hybrid language. I finish with a discussion of the place of state-names in modal logic.
منابع مشابه
Labelled Natural Deduction for Substructural Logics
In this paper a uniform methodology to perform Natural Deduction over the family of linear, relevance and intuitionistic logics is proposed. The methodology follows the Labelled Deductive Systems (LDS) discipline, where the deductive process manipulates declarative units { formulas labelled according to a labelling algebra. In the system described here, labels are either ground terms or variabl...
متن کاملInde nites as Epsilon Terms: A Labelled Deduction Account
This paper gives an account of indeenites as epsilon terms within a model of utterance processing as a task of labelled deduction, in which partially speciied inputs are progressively resolved during the interpretation process. The formal tools used are labelled deduction (Gabbay forthcoming), the epsilon calculus (Meyer-Viol 1995), and a tree-logic (LOFT-Blackburn & Meyer-Viol 1994) which char...
متن کاملAlgorithmic Deduction Based on Labelled Tableaux Project Gr/j14745 -final Report for Epsrc
This report describes the research results obtained during the EPSRC project GR/J14745, giving rstly a summary of the results, with respect to the objectives given in the Research Grant Report and a brief introduction of the project's research eld (in Section 1.2).
متن کاملSynthetic completeness proofs for Seligman-style tableau systems
Hybrid logic is a form of modal logic which allows reference to worlds. We can think of it as ‘modal logic with labelling built into the object language’ and various forms of labelled deduction have played a central role in its proof theory. Jerry Seligman’s work [13,14] in which ‘rules involving labels’ are rejected in favour of ‘rules for all’ is an interesting exception to this. Seligman’s a...
متن کاملA Gentzen-style sequent calculus of constructions with expansion rules
A Gentzen-style L-formulation of the calculus of constructions is presented and proved equivalent to a natural deduction formulation based on that of [6]. The L-rules corresponding to the conversion rules of the natural deduction system are expansion rules. Cut elimination follows from the equivalence to the natural deduction formulation and the normalization theorem for the latter.
متن کامل